Degrees of Freedom of Cache-Aided Wireless Interference Networks
نویسندگان
چکیده
منابع مشابه
Degrees of Freedom of Cache-Aided Wireless Interference Networks
We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both transmitters and receivers are equipped with caches. We provide a constant-factor approximation of the system’s degrees of freedom (DoF), for arbitrary number of transmitters, number of receivers, content library size, receiver cache size, an...
متن کاملDegrees of freedom of wireless interference network
The degrees of freedom (DoF) concept is very useful for studying the multi-user communications system at high signal-to-noise ratio region. The research on DoF leads to an important technology advancement in wireless communications, the interference alignment. The idea of interference alignment is to design the transmit signals structurally such that the interference signals from multiple inter...
متن کاملDegrees of Freedom in Wireless Networks
This paper did a survey in the area of degrees of freedom (DoF) in wireless network. We give the definitions of degrees of freedom in different areas first. Then we introduce some methods used to determine the degrees of freedom in different scenario. In section IV, we discuss the applications of the degrees of freedom. We state some interesting open questions in the end of this survey.
متن کاملMaximizing Degrees of Freedom in Wireless Networks
We consider a wireless network with fading and a single source-destination pair. The information reaches the destination through a sequence of layers of relays. A nonseparation based strategy is proposed which achieves a rate equal to the capacity of a point-to-point multiantenna system [1, 2], in the high SNR limit. Our result can also be thought of as an extension of [1, 2] for wireless netwo...
متن کاملDegrees of Freedom of Interference Networks with Transmitter-Side Caches
This paper studies cache-aided interference networks with arbitrary number of transmitters and receivers, whereby each transmitter has a cache memory of finite size. Each transmitter fills its cache memory from a content library of files in the placement phase. In the subsequent delivery phase, each receiver requests one of the library files, and the transmitters are responsible for delivering ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2825321